An Iterative Algorithm for a Hierarchical Problem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Iterative Algorithm for a Hierarchical Problem

where S, T are two nonexpansive mappings and Fix T is the set of fixed points of T . Recently, this problem has been studied by many authors see, e.g., 1–15 . The main reason is that this problem is closely associated with some monotone variational inequalities and convex programming problems see 16–19 . Now, we briefly recall some historic results which relate to the problem 1.1 . For solving ...

متن کامل

Hybrid steepest iterative algorithm for a hierarchical fixed point problem

The purpose of this work is to introduce and study an iterative method to approximate solutions of a hierarchical fixed point problem and a variational inequality problem involving a finite family of nonexpansive mappings on a real Hilbert space. Further, we prove that the sequence generated by the proposed iterative method converges to a solution of the hierarchical fixed point problem for a f...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

An iterative algorithm for two level hierarchical time minimization transportation problem

This paper discusses a two level hierarchical time minimization transportation problem, in which the whole set of source–destination links consists of twodisjoint partitions namely Level-I and Level-II links. Somequantity of a homogeneous product is first shipped from sources to destinations by Level-I decision makers using only Level-I links, and on its completion the Level-II decision maker t...

متن کامل

A Three-Level Mathematical Model for an r-interdiction Hierarchical Facilities Location Problem

In general, any system may be at risk in a case of losing the critical facilities by natural disasters or terrorist attacks. This paper focuses on identifying the critical facilities and planning to reduce the effect of this event. A three-level model is suggested in the form of a defender-attacker-defender. It is assumed that the facilities are hierarchical and capable of nesting. Also, the at...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Mathematics

سال: 2012

ISSN: 1110-757X,1687-0042

DOI: 10.1155/2012/320421